Computing Intersection Multiplicity via Triangular Decomposition
نویسنده
چکیده
Fulton’s algorithm is used to calculate the intersection multiplicity of two plane curves about a rational point. This work extends Fulton’s algorithm first to algebraic points (encoded by regular chains) and then, with some generic assumptions, to l many hypersurfaces. Out of necessity, we give a standard-basis free method (i.e. practically efficient method) for calculating tangent cones at points on curves.
منابع مشابه
Zero Decomposition with Multiplicity of Zero-Dimensional Polynomial Systems
We present a zero decomposition theorem and an algorithm based on Wu’s method, which computes a zero decomposition with multiplicity for a given zerodimensional polynomial system. If the system satisfies some condition, the zero decomposition is of triangular form.
متن کاملMultiplicity-preserving triangular set decomposition of two polynomials
In this paper, a multiplicity preserving triangular set decomposition algorithm is proposed for a system of two polynomials. The algorithm decomposes the variety defined by the polynomial system into unmixed components represented by triangular sets, which may have negative multiplicities. In the bivariate case, we give a complete algorithm to decompose the system into multiplicity preserving t...
متن کاملComputing Symmetric Rank-Revealing Decompositions via Triangular Factorization
We present a family of algorithms for computing symmetric rank-revealing VSV decompositions, based on triangular factorization of the matrix. The VSV decomposition consists of a middle symmetric matrix that reveals the numerical rank in having three blocks with small norm, plus an orthogonalmatrix whose columns span approximations to the numerical range and null space. We show that for semi-de ...
متن کاملA QR-method for computing the singular values via semiseparable matrices
A QR–method for computing the singular values via semiseparable matrices. Abstract The standard procedure to compute the singular value decomposition of a dense matrix, first reduces it into a bidiagonal one by means of orthogonal transformations. Once the bidiagonal matrix has been computed, the QR–method is applied to reduce the latter matrix into a diagonal one. In this paper we propose a ne...
متن کاملDecomposition and Intersection of Two Fuzzy Numbers for Fuzzy Preference Relations
In fuzzy decision problems, the ordering of fuzzy numbers is the basic problem. The fuzzy preference relation is the reasonable representation of preference relations by a fuzzy membership function. This paper studies Nakamura’s and Kołodziejczyk’s preference relations. Eight cases, each representing different levels of overlap between two triangular fuzzy numbers are considered. We analyze the...
متن کامل